State Assignment for Finite State Machine Synthesis

This paper proposes simulated annealing based algorithm for the synthesis of a finite state machine to determine the optimal state assignment with less area and power dissipation. The algorithm has two annealing stages. In the first rough annealing stage it tries to search in global scope by the proposed rough search method. In the second focusing annealing stage it tries to search in local scope by using proposed focusing search methods intending changing solution slightly. In both stages, the experience of past solution is utilised by combing the best solution in the past and the current solution. The experiments performed on a large suite of benchmarks have established the fact that the proposed method outperforms the published GA-based algorithms. The results have shown the effectiveness of the proposed method in achieving optimal state assignment for finite state machine.